Papers with Adam optimizer

5 papers
CAME: Confidence-guided Adaptive Memory Efficient Optimization (2023.acl-long)

Copied to clipboard

Challenge: Existing memory-efficient methods require second-moment estimates of the per-parameter gradients to maintain their performance.
Approach: They propose to use memory-efficient optimizers to reduce memory usage by preserving second-moment estimates of gradients.
Outcome: The proposed method achieves fast convergence and lower memory usage across training tasks.
MUZO: Leveraging Multiple Queries and Momentum for Zeroth-Order Fine-Tuning of Large Language Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models incur memory overhead due to the need for activation storage for back-propagation (BP).
Approach: They propose a method that estimates gradients through finite differences without activation storage for back-propagation.
Outcome: The proposed method demonstrates superior performance in fine-tuning various LLMs.
Recall and Learn: Fine-tuning Deep Pretrained Language Models with Less Forgetting (2020.emnlp-main)

Copied to clipboard

Challenge: Existing methods to fine-tune deep pretrained language models face catastrophic forgetting problems.
Approach: They propose a recall and learn mechanism which integrates pretraining and downstream tasks into a single mechanism.
Outcome: The proposed method achieves state-of-the-art performance on the GLUE benchmark and better average performance than directly fine-tuning of BERT-large.
AdaLomo: Low-memory Optimization with Adaptive Learning Rate (2024.findings-acl)

Copied to clipboard

Challenge: Large language models require substantial memory for training, thereby setting a high hardware threshold.
Approach: They propose a low-memory optimization technique that reduces memory footprint . they propose an adaptive learning rate for each parameter and a grouped update normalization to stabilize convergence .
Outcome: The proposed low-memory optimization performs better than the prevailing algorithm for large language models, AdamW.
PAC-tuning: Fine-tuning Pre-trained Language Models with PAC-driven Perturbed Gradient Descent (2023.emnlp-main)

Copied to clipboard

Challenge: PAC-tuning is a two-stage fine-tune method for pretrained language models . PAC training minimizes the PACBayes generalization bound to learn proper parameter distribution .
Approach: They propose a two-stage fine-tuning method to minimize the PAC-Bayes generalization bound . they use PAC to inject noise with variance learned in the first stage into the model parameters .
Outcome: The proposed method outperforms baseline methods on 5 GLUE benchmark tasks.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations